6 Lecture 2 : March 21 2006

نویسندگان

  • Yishay Mansour
  • Ricky Rosen
چکیده

In this lecture we examine “players machine” games, where each player chooses a machine to place her job at. We look at a global optimum function. We basically deal with two models: pure, where the players choose a deterministic strategy, and mixed, where the players choose a stochastic strategy (i.e., each chooses a probability distribution over machines). We farther examine different types of games such as identical machines (equal speed to all the machines), non-identical machine (different speed). We introduce the measure price of anarchy to capture the “quality” of equilibria and specify the price of anarchy in each model. The main goal is to compare the “quality” of Nash equilibrium (NE ) to the “quality” of a global optimum (OPT ). The following examples will help us understand the notion of the Price of Anarchy :

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Math 140a: Foundations of Real Analysis I

1. Ordered Sets, Ordered Fields, and Completeness 1 1.1. Lecture 1: January 5, 2016 1 1.2. Lecture 2: January 7, 2016 4 1.3. Lecture 3: January 11, 2016 7 1.4. Lecture 4: January 14, 2014 9 2. Sequences and Limits 13 2.1. Lecture 5: January 19, 2016 13 2.2. Lecture 6: January 21, 2016 15 2.3. Lecture 7: January 26, 2016 18 2.4. Lecture 8: January 28, 2016 21 3. Extensions of R: the Extended Rea...

متن کامل

A Bibliography of Papers in Lecture Notes in Computer Science (2003) (Part 1 of 4)

ABC [6]. ABC/ADL [6]. Abstract [14]. Access [71]. Ada [29]. Address [157]. Address-Bit [157]. ADL [6]. AES [134]. after [78]. against [86]. Agents [28]. AKS [111]. Algebra [29]. Algebraic [94]. Algorithm [38]. Algorithms [138]. Analysis [24]. Animation [21]. Anonymity [69]. Application [134]. Applications [74]. Approach [15]. Arbitrarily [96]. Architecture [1]. architectures [11]. Arithmetic [7...

متن کامل

Sequent Calculus and the Speciication of Computation Lecture Notes

These notes are being used with lectures for CSE 520 at Penn State in September 1998. These notes had been prepared to accompany lectures given at the Marktoberdorf Summer School, 29 July { 10 August 1997 for a course titled \Proof Theoretic Speciication of Computation". An earlier draft was used in courses given between 27 January and 11 February 1997 at the University of Siena and between 6 a...

متن کامل

The Mumford conjecture, Madsen-Weiss and homological stability for mapping class groups of surfaces

The Mumford conjecture, Madsen-Weiss and homological stability for mapping class groups of surfaces 3 Introduction 3 Lecture 1. The Mumford conjecture and the Madsen-Weiss theorem 5 1. The Mumford conjecture 5 2. Moduli space, mapping class groups and diffeomorphism groups 5 3. The Mumford-Morita-Miller classes 7 4. Homological stability 7 5. The Madsen-Weiss theorem 9 6. Exercices 10 Lecture 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006